Scheduling for Transfers in Pickup and Delivery Problems with Very Large Neighborhood Search
نویسندگان
چکیده
In pickup and delivery problems (PDPs), vehicles pickup and deliver a set of items under various constraints. We address the PDP with Transfers (PDP-T), in which vehicles plan to transfer items between one another to form more efficient schedules. We introduce the Very Large Neighborhood Search with Transfers (VLNS-T) algorithm to form schedules for the PDP-T. Our approach allows multiple transfers for items at arbitrary locations, and is not restricted to a set of predefined transfer points. We show that VLNS-T improves upon the best known PDP solutions for benchmark problems, and demonstrate its effectiveness on problems sampled from real world taxi data in New York City.
منابع مشابه
Solving the Vehicle Routing Problem with Simultaneous Pickup and Delivery by an Effective Ant Colony Optimization
One of the most important extensions of the capacitated vehicle routing problem (CVRP) is the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) where customers require simultaneous delivery and pick-up service. In this paper, we propose an effective ant colony optimization (EACO) which includes insert, swap and 2-Opt moves for solving VRPSPD that is different with common an...
متن کاملAn Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Transfers
The Pickup and Delivery Problem (PDP) consists in defining a set of routes that satisfy transportation requests between a pickup point and a delivery point. This paper addresses a variant of the PDP where the requests are transportation demands arising from disabled persons. Vehicle passengers can change of vehicle during their trip on specific locations called “transfer points”. Solving this v...
متن کاملAn Improved Modified Tabu Search Algorithm to Solve the Vehicle Routing Problem with Simultaneous Pickup and Delivery
The vehicle routing problem with simultaneous pickup and delivery (VRPSPD) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. The objective is to minimize the distance traveled. The VRPSPD is an NP-hard combinatorial optimization problem. Therefore, practical large-scale instances of VR...
متن کاملAn Improved Modified Tabu Search Algorithm to Solve the Vehicle Routing Problem with Simultaneous Pickup and Delivery
The vehicle routing problem with simultaneous pickup and delivery (VRPSPD) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. The objective is to minimize the distance traveled. The VRPSPD is an NP-hard combinatorial optimization problem. Therefore, practical large-scale instances of VR...
متن کاملImproving the Initialization and Repair Heuristics to Effectively Solve the Pickup and Delivery Problems with Time Windows
Pickup and delivery problems with time windows (PDPTW) are challenging yet realistic scheduling problems in which each delivery vehicle is assigned to handle different pairs of pickup-anddelivery requests. Our previous work successfully adapted the push forward insertion heuristic (PFIH) for initialization, and proposed a new swap operator to effectively solve PDP-TWs. In this paper, we improve...
متن کامل